Strategic Argumentation is NP-Complete
نویسندگان
چکیده
We study the complexity of the Strategic Argumentation Problem for 2-player dialogue games where a player should decide what move (set of rules) to play at each turn in order to prove (disprove) a given thesis. We show that this is an NP-complete problem.
منابع مشابه
Strategic Argumentation Under Grounded Semantics is NP-Complete
We study the complexity of the Strategic Argumentation Problem for 2-player dialogue games where a player should decide what move to play at each turn in order to prove (disprove) a given claim. We shall prove that this is an NP-complete problem. The result covers one the most popular argumentation semantics proposed by Dung [4]: the grounded semantics.
متن کاملWizArg: Visual Argumentation Framework Solving Wizard
Extension-based argumentation semantics have shown to be a suitable approach for performing practical reasoning. An important concern in extensionbased-argumentation semantics is the computational complexity of the decision problems that has been shown to range from NP-complete to Π 2 -complete. In this paper, we introduce a generic extension-based argumentation semantics solver, that is called...
متن کاملTwo Faces of Strategic Argumentation in the Law
In strategic argumentation players exchange arguments to prove or reject a claim. This paper discusses and reports on research about two basic issues regarding the game-theoretic understanding of strategic argumentation games in the law: whether such games can be reasonably modelled as zero-sum games and as games with complete information.
متن کاملComplexity Results and Algorithms for Extension Enforcement in Abstract Argumentation
Understanding the dynamics of argumentation frameworks (AFs) is important in the study of argumentation in AI. In this work, we focus on the so-called extension enforcement problem in abstract argumentation. We provide a nearly complete computational complexity map of fixed-argument extension enforcement under various major AF semantics, with results ranging from polynomial-time algorithms to c...
متن کاملTesting Credulous and Sceptical Acceptance in Small-World Networks
In this paper we test how efficiently state-of-the art solvers are capable of solving credulous and sceptical argument-acceptance for lower-order extensions. As our benchmark we consider two different random graph-models to obtain random Abstract Argumentation Frameworks with small-world characteristics: Kleinberg and Watt-Strogatz. We test two reasoners, i.e., ConArg2 and dynPARTIX, on such be...
متن کامل